Greedy algorithms for a class of knapsack problems with binary weights
نویسندگان
چکیده
In this article we identify a class of two-dimensional knapsack problems and related three-criteria unconstrained combinatorial optimization problems that can be solved in polynomial time by greedy algorithms. For the latter problem, the proposed algorithm explores the connectedness of the set of efficient solutions. Extensive computational results show that this approach can solve the three-criteria problem up to one million items in half an hour.
منابع مشابه
BQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملAdvanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
New variants of greedy algorithms, called advanced greedy algorithms, are identified for knapsack and covering problems with linear and quadratic objective functions. Beginning with single-constraint problems, we provide extensions for multiple knapsack and covering problems, in which objects must be allocated to different knapsacks and covers, and also for multi-constraint (multi-dimensional) ...
متن کاملSolving the Hard Knapsack Problems with a Binary Particle Swarm Approach
Knapsack problems are important NP-Complete combinatorial optimization problems. Although nearly all the classical instances can be solved in pseudo-polynomial time nowadays, yet there are a variety of test problems which are hard to solve for the existing algorithms. In this paper we propose a new approach based upon binary particle swarm optimization algorithm (BPSO) to find solutions of thes...
متن کاملGreedy Algorithm 3 Knapsack Problem 3.1 Fractional Knapsack Problem
Greedy algorithm is a group of algorithms that have one common characteristic, making the best choice locally at each step without considering future plans. Thus, the essence of greedy algorithm is a choice function: given a set of options, choose the current best option. Because of the myopic nature of greedy algorithm, it is (as expected) not correct for many problems. However, there are cert...
متن کاملGenetic Algorithm with Directional Mutation Based on Greedy Strategy for Large-scale 0-1 Knapsack Problems
In view of the lack of efficiency or accuracy of solving large-scale 0-1 knapsack problems by the classic genetic algorithm, a directional mutation operator is designed to reduce the probability of resampling in the search process. Meanwhile an initializing operator and an individual correction operator are added to the algorithm to modify individual after every amendment, both of which are com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 39 شماره
صفحات -
تاریخ انتشار 2012